package binarySortTree;

public class Test {
    public static void main(String[] args) {
        int[] nums = {1,3,5,7,9,4};
        Node root = new Node(1);
        BinarySortTree bst = new BinarySortTree(root);
        for(int i=1;i<nums.length;i++){
            bst.addNode(new Node(nums[i]));
        }
        bst.infixOrder(root);
        System.out.println("============================");
        bst.delNode2(9);
        bst.infixOrder(root);
    }
}
